منابع مشابه
Constructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملInjective colorings of sparse graphs
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let χi(G) denote the injective chromatic number of G. We prove that if mad(G) ≤ 5 2 , then χi(G) ≤ ∆(G) + 1; and if mad(G) < 42 19 , then χi(G) = ∆(G). Suppose that G is a planar graph with girth g(G) and ∆(G) ≥ 4. We prove that if g(G) ≥ 9, then χi(G) ≤ ∆(G) + 1; similarly, if g(G) ≥ 13, then χi(G) = ∆(G).
متن کاملInjective Maps between Flip Graphs
We prove that every injective simplicial map F(S) → F(S′) between flip graphs is induced by a subsurface inclusion S → S′, except in finitely many cases. This extends a result of Korkmaz–Papadopoulos which asserts that every automorphism of the flip graph of a surface without boundary is induced by a surface homeomorphism.
متن کاملInjective Chromatic Sum and Injective Chromatic Polynomials of Graphs
The injective chromatic number χi(G) [5] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. In this paper we define injective chromatic sum and injective strength of a graph and obtain the injective chromatic sum of complete graph, paths, cycles, wheel graph and complete bipartite graph. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00073-5